Unbounded Non-determinism in CSP
نویسندگان
چکیده
منابع مشابه
Unbounded Nondeterminism in CSP
We extend the failures/divergences model for CSP to include a component of infinite traces. This allows us to give a denotational semantics for a version of CSP including general nondeterministic choice and infinite hiding. Unfortunately the model is an incomplete partial order, so it is by no means obvious that the necessary fixed points exist. We have two proofs of this result, one via a cong...
متن کاملCSP and determinism in security modelling
We show how a variety of confidentiality properties can be expressed in terms of the abstraction mechanisms that CSP provides. We argue that determinism of the abstracted low-security viewpoint provides the best type of property. By changing the form of abstraction mechanism we are able to model different assumptions about how systems behave, including handling the distinction between input and...
متن کاملLocal Analysis of Determinism for CSP
Nondeterminism is an inevitable constituent of any theory that describes concurrency. For the validation and verification of concurrent systems, it is essential to investigate the presence or absence of nondeterminism, just as much as deadlock or livelock. CSP is a well established process algebra; the main tool for practical use of CSP, the model checker FDR, checks determinism using a global ...
متن کاملModelling unbounded parallel sessions of security protocols in CSP
We show that a simplification to earlier CSP models designed to prove protocols correct on the FDR model checker is valid. This both allows us to extend the scope of our proofs and produce checks that are enormously more efficient.
متن کاملResolving Non-determinism in Choreographies
Abstract. Resolving non-deterministic choices of choreographies is a crucial task. We introduce a novel notion of realisability for choreographies –called whole-spectrum implementation– that rules out deterministic implementations of roles that, no matter which context they are placed in, will never follow one of the branches of a non-deterministic choice. We show that, under some conditions, i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logic and Computation
سال: 1993
ISSN: 0955-792X,1465-363X
DOI: 10.1093/logcom/3.2.131